https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 A linear algorithm for a perfect matching in polyomino graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:34717 Fri 26 Apr 2019 15:52:14 AEST ]]> Connectivity and matching preclusion for leaf-sort graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:43361 CFₙ is 3n−3/2 (3n−3/2) for odd n and 3n−4/2(3n−4/2) for even n; (2) CFₙ is super edge-connected; (3) the matching preclusion number of CFₙ is 3n−3/2 for odd n and 3n−4/2 for even n; (4) the conditional matching preclusion number of CFₙ is 3n – 5 for odd n and n ≥ 3, and 3n – 6 for even n and n ≥ 4.]]> Fri 16 Sep 2022 08:32:44 AEST ]]>